Computational number theory - PDFSEARCH.IO - Document Search Engine

Computational number theory
Results: 224

#	Item
111	The Computational Complexity of Random Serial Dictatorship Haris Aziza,∗, Felix Brandtb , Markus Brillb a NICTA and UNSW, 223 Anzac Parade, Sydney, NSW 2033, Australia, Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2013-08-26 14:45:19 Number theory Abstract algebra Permutation Pi Factorial Computational complexity theory Mathematics Mathematical analysis Combinatorics
112	International Scholarly Research Network ISRN Communications and Networking Volume 2012, Article ID[removed], 8 pages doi:[removed][removed]Research Article Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2014-08-14 11:59:28 Combinatorics Number theory Core Minimum bounding box Shapley value Computational complexity theory Factorial Algorithm Mathematics Game theory Cooperative games
113	Arithmetic – Multiplication, DFT, FFT In this lecture, we study the bit-complexity of various fundamental arithmetic operations for integers and polynomials. This lecture is based upon [2, Chap. 1] . ¶1. Representati Add to Reading List Source URL: www.imsc.res.in Language: English - Date: 2012-01-30 02:21:41 Fourier analysis Digital signal processing Multiplication Computational complexity theory Number theory Discrete Fourier transform Fast Fourier transform Multiplication algorithm Root of unity Mathematics Mathematical analysis Theoretical computer science
114	The Function Field Sieve in the Medium Prime Case Antoine Joux1,3 and Reynald Lercier1,2 1 DGA Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:53 Integer factorization algorithms Finite fields Logarithms Group theory Cryptography General number field sieve Discrete logarithm Polynomial Computational complexity theory Abstract algebra Mathematics Algebra
115	Complexity of Bézout’s Theorem and the Condition Number Jean-Pierre Dedieu Institut de Mathématiques de Toulouse, France Fields Institute, Thematic Program on the Foundations of Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2009-10-23 10:42:16 Computational complexity theory Complexity classes Abstraction Complex systems theory Complexity Holism PP Polynomial P Theoretical computer science Algebra Mathematics
116	Algebraic Number Theory, a Computational Approach William Stein November 14, 2012 2 Add to Reading List Source URL: sage.math.washington.edu Language: English - Date: 2012-11-14 13:32:54 Field theory Galois theory Algebraic number field Class field theory Ideal class group Galois module Prime number Field Galois cohomology Abstract algebra Algebra Algebraic number theory
117	The Insecurity of Esign in Practical Implementations Pierre-Alain Fouque1 , Nick Howgrave-Graham2 , Gwena¨elle Martinet3 , and Guillaume Poupard3 ´ Ecole Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:54 Computational number theory Lattice points Algebra Abstract algebra RSA Lenstra–Lenstra–Lovász lattice basis reduction algorithm Lattice Mathematics Electronic commerce Public-key cryptography
118	Lattice-based Cryptography Oded Regev? Tel Aviv University, Israel Abstract. We describe some of the recent progress on lattice-based cryptography, starting from the seminal work of Ajtai, and ending with Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:55 Lattice points Computational number theory Lattice problem Lattice-based cryptography Lattice Ideal lattice cryptography NTRUSign Lenstra–Lenstra–Lovász lattice basis reduction algorithm Reciprocal lattice Cryptography Mathematics Post-quantum cryptography
119	MAPREDUCE FOR INTEGER FACTORIZATION arXiv:1001.0421v1 [cs.DC] 4 Jan 2010 JAVIER TORDABLE Abstract. Integer factorization is a very hard computational problem. Currently no efficient algorithm for integer factorization i Add to Reading List Source URL: arxiv.org Language: English - Date: 2010-01-03 19:17:14 Number theory Quadratic sieve General number field sieve MapReduce Integer factorization Quadratic residue Factor base Factorization RSA Integer factorization algorithms Cryptography Mathematics
120	On Diophantine Complexity and Statistical Zero-Knowledge Arguments Helger Lipmaa Laboratory for Theoretical CS, Department of CS&E Helsinki University of Technology, P.O.Box 5400, FIN[removed]HUT, Espoo, Finland helger@tcs Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:54 Diophantine equations Euclidean algorithm Diophantine set Polynomial Time complexity Large numbers Number theory PP P Theoretical computer science Computational complexity theory Applied mathematics

UPDATE